
<HTML>
<HEAD>
<LINK rel="stylesheet" href="exer.css">
</HEAD>
<BODY>
<H1>
<font color=red>
Data Structures, Algorithms, & Applications in C++, 2nd Edition<BR>
Sartaj Sahni<br>
<br>
Index of Text Programs<br>
<BR>
</font>
</H1>

Most of the files with a .h extension have a corresponding .cpp file that contains a test program.
Sample input data (where appropriate) and the generated output may be found in
correspondingly named files with a .input and .output extension.
<br><br>
Select a chapter.<br>

<a href = "#Chapter 1">Chapter 1</a>
<br>
<a href = "#Chapter 2">Chapter 2</a>
<br>
<a href = "#Chapter 3">Chapter 3</a>
<br>
<a href = "#Chapter 4">Chapter 4</a>
<br>
<a href = "#Chapter 5">Chapter 5</a>
<br>
<a href = "#Chapter 6">Chapter 6</a>
<br>
<a href = "#Chapter 7">Chapter 7</a>
<br>
<a href = "#Chapter 8">Chapter 8</a>
<br>
<a href = "#Chapter 9">Chapter 9</a>
<br>
<a href = "#Chapter 10">Chapter 10</a>
<br>
<a href = "#Chapter 11">Chapter 11</a>
<br>
<a href = "#Chapter 12">Chapter 12</a>
<br>
<a href = "#Chapter 13">Chapter 13</a>
<br>
<a href = "#Chapter 14">Chapter 14</a>
<br>
<a href = "#Chapter 15">Chapter 15</a>
<br>
<a href = "#Chapter 16">Chapter 16</a>
<br>
<a href = "#Chapter 17">Chapter 17</a>
<br>
<a href = "#Chapter 18">Chapter 18</a>
<br>
<a href = "#Chapter 19">Chapter 19</a>
<br>
<a href = "#Chapter 20">Chapter 20</a>
<br>
<a href = "#Chapter 21">Chapter 21</a>
<br><br>
<a name = "Chapter 1"></a>
<h3>Chapter 1 Programs</h3>
<A href="abcInt.cpp">Program 1.1
abcInt.cpp</A>
<br>
<A href="abcFloat.cpp">Program 1.2
abcFloat.cpp</A>
<br>
<A href="abcTemplate.cpp">Program 1.3
abcTemplate.cpp</A>
<br>
<A href="abcRef.cpp">Program 1.4
abcRef.cpp</A>
<br>
<A href="abcConstRef.cpp">Program 1.5
abcConstRef.cpp</A>
<br>
<A href="abcGeneral.cpp">Program 1.6
abcGeneral.cpp</A>
<br>
<A href="noSwap.cpp">Program 1.7
noSwap.cpp</A>
<br>
<A href="abcExceptionChar.cpp">Program 1.8
abcExceptionChar.cpp</A>
<br>
<A href="abcExceptionChar.cpp">Program 1.9
abcExceptionChar.cpp</A>
<br>
<A href="make2dArray.h">Program 1.10
make2dArray.h</A>
<br>
<A href="make2dArrayNoCatch.h">Program 1.11
make2dArrayNoCatch.h</A>
<br>
<A href="delete2dArray.h">Program 1.12
delete2dArray.h</A>
<br>
<A href="currency.h">Program 1.13
currency.h</A>
<br>
<A href="currency.h">Program 1.14
currency.h</A>
<br>
<A href="currency.h">Program 1.15
currency.h</A>
<br>
<A href="currency.h">Program 1.16
currency.h</A>
<br>
<A href="currency.h">Program 1.17
currency.h</A>
<br>
<A href="currency.cpp">Program 1.18
currency.cpp</A>
<br>
<A href="currencyNew.h">Program 1.19
currencyNew.h</A>
<br>
<A href="currencyNew.h">Program 1.20
currencyNew.h</A>
<br>
<A href="currencyNew.h">Program 1.21
currencyNew.h</A>
<br>
<A href="currencyOverload.h">Program 1.22
currencyOverload.h</A>
<br>
<A href="currencyOverload.h">Program 1.23
currencyOverload.h</A>
<br>
<A href="currencyOverload.cpp">Program 1.24
currencyOverload.cpp</A>
<br>
<A href="currencyFriend.h">Program 1.25
currencyFriend.h</A>
<br>
<A href="myExceptions.h">Program 1.26
myExceptions.h</A>
<br>
<A href="abcException.cpp">Program 1.27
abcException.cpp</A>
<br>
<A href="abcException.cpp">Program 1.28
abcException.cpp</A>
<br>
<A href="factorial.cpp">Program 1.29
factorial.cpp</A>
<br>
<A href="sum.cpp">Program 1.30
sum.cpp</A>
<br>
<A href="rSum.cpp">Program 1.31
rSum.cpp</A>
<br>
<A href="permutations.cpp">Program 1.32
permutations.cpp</A>
<br>
<A href="sumSTL.cpp">Program 1.33
sumSTL.cpp</A>
<br>
<A href="productSTL.cpp">Program 1.34
productSTL.cpp</A>
<br>
<A href="permutationsSTL.cpp">Program 1.35
permutationsSTL.cpp</A>
<br>
<A href="quadraticRoots.cpp">Program 1.36
quadraticRoots.cpp</A>
<br>
<A href="indexOfMax.cpp">Program 1.37
indexOfMax.cpp</A>
<br>
<br><br>
<a name = "Chapter 2"></a>
<h3>Chapter 2 Programs</h3>
<A href="sequentialSearch1.cpp">Program 2.1
sequentialSearch1.cpp</A>
<br>
<A href="rSequentialSearch.cpp">Program 2.2
rSequentialSearch.cpp</A>
<br>
<A href="ployEval.cpp">Program 2.3
ployEval.cpp</A>
<br>
<A href="horner.cpp">Program 2.4
horner.cpp</A>
<br>
<A href="rank.cpp">Program 2.5
rank.cpp</A>
<br>
<A href="rankSort1.cpp">Program 2.6
rankSort1.cpp</A>
<br>
<A href="selectionSort.cpp">Program 2.7
selectionSort.cpp</A>
<br>
<A href="bubbleSort.cpp">Program 2.8
bubbleSort.cpp</A>
<br>
<A href="bubbleSort.cpp">Program 2.9
bubbleSort.cpp</A>
<br>
<A href="insert.cpp">Program 2.10
insert.cpp</A>
<br>
<A href="rankSort2.cpp">Program 2.11
rankSort2.cpp</A>
<br>
<A href="earlySelectionSort.cpp">Program 2.12
earlySelectionSort.cpp</A>
<br>
<A href="earlyBubbleSort.cpp">Program 2.13
earlyBubbleSort.cpp</A>
<br>
<A href="insertionSort1.cpp">Program 2.14
insertionSort1.cpp</A>
<br>
<A href="insertionSort2.cpp">Program 2.15
insertionSort2.cpp</A>
<br>
<A href="sumCount1.cpp">Program 2.16
sumCount1.cpp</A>
<br>
<A href="sumCount2.cpp">Program 2.17
sumCount2.cpp</A>
<br>
<A href="rSumCount.cpp">Program 2.18
rSumCount.cpp</A>
<br>
<A href="matrixTranspose.cpp">Program 2.19
matrixTranspose.cpp</A>
<br>
<A href="inef.cpp">Program 2.20
inef.cpp</A>
<br>
<A href="matrixAdd.cpp">Program 2.21
matrixAdd.cpp</A>
<br>
<A href="matrixMultiply1.cpp">Program 2.22
matrixMultiply1.cpp</A>
<br>
<A href="matrixMultiply2.cpp">Program 2.23
matrixMultiply2.cpp</A>
<br>
<A href="minMax1.cpp">Program 2.24
minMax1.cpp</A>
<br>
<A href="minMax2.cpp">Program 2.25
minMax2.cpp</A>
<br>
<A href="sequentialSearch2.cpp">Program 2.26
sequentialSearch2.cpp</A>
<br>
<A href="d.cpp">Program 2.27
d.cpp</A>
<br>
<br><br>
<a name = "Chapter 3"></a>
<h3>Chapter 3 Programs</h3>
<A href="binarySearch.cpp">Program 3.1
binarySearch.cpp</A>
<br>
<br><br>
<a name = "Chapter 4"></a>
<h3>Chapter 4 Programs</h3>
<A href="timeInsertionSort1.cpp">Program 4.1
timeInsertionSort1.cpp</A>
<br>
<A href="timeInsertionSort2.cpp">Program 4.2
timeInsertionSort2.cpp</A>
<br>
<A href="timeInsertionSort3.cpp">Program 4.3
timeInsertionSort3.cpp</A>
<br>
<A href="matrixMultiply3.cpp">Program 4.4
matrixMultiply3.cpp</A>
<br>
<br><br>
<a name = "Chapter 5"></a>
<h3>Chapter 5 Programs</h3>
<A href="linearList.h">Program 5.1
linearList.h</A>
<br>
<A href="changeLength1D.h">Program 5.2
changeLength1D.h</A>
<br>
<A href="arrayList.h">Program 5.3
arrayList.h</A>
<br>
<A href="arrayList.h">Program 5.4
arrayList.h</A>
<br>
<A href="arrayList.h">Program 5.5
arrayList.h</A>
<br>
<A href="arrayList.h">Program 5.6
arrayList.h</A>
<br>
<A href="arrayList.h">Program 5.7
arrayList.h</A>
<br>
<A href="arrayList.h">Program 5.8
arrayList.h</A>
<br>
<A href="arrayIterator.h">Program 5.9
arrayIterator.h</A>
<br>
<A href="arrayListWithIterator.h">Program 5.11
arrayListWithIterator.h</A>
<br>
<A href="vectorList.h">Program 5.12
vectorList.h</A>
<br>
<A href="vectorList.h">Program 5.13
vectorList.h</A>
<br>
<A href="vectorList.h">Program 5.14
vectorList.h</A>
<br>
<br><br>
<a name = "Chapter 6"></a>
<h3>Chapter 6 Programs</h3>
<A href="chainNode.h">Program 6.1
chainNode.h</A>
<br>
<A href="chain.h">Program 6.2
chain.h</A>
<br>
<A href="chain.h">Program 6.3
chain.h</A>
<br>
<A href="chain.h">Program 6.4
chain.h</A>
<br>
<A href="chain.h">Program 6.5
chain.h</A>
<br>
<A href="chain.h">Program 6.6
chain.h</A>
<br>
<A href="chain.h">Program 6.7
chain.h</A>
<br>
<A href="chain.h">Program 6.8
chain.h</A>
<br>
<A href="chain.h">Program 6.9
chain.h</A>
<br>
<A href="chainWithIterator.h">Program 6.10
chainWithIterator.h</A>
<br>
<A href="extendedLinearList.h">Program 6.11
extendedLinearList.h</A>
<br>
<A href="extendedChain.h">Program 6.12
extendedChain.h</A>
<br>
<A href="circularListWithHeader.h">Program 6.13
circularListWithHeader.h</A>
<br>
<A href="studentRecord1.h">Program 6.14
studentRecord1.h</A>
<br>
<A href="studentRecord2.h">Program 6.15
studentRecord2.h</A>
<br>
<A href="studentRecord3.h">Program 6.16
studentRecord3.h</A>
<br>
<A href="binsort1.h">Program 6.17
binsort1.h</A>
<br>
<A href="chainWithBinSort.h">Program 6.18
chainWithBinSort.h, binsort2.cpp</A>
<br>
<A href="unionFindWithArrays.h">Program 6.19
unionFindWithArrays.cpp</A>
<br>
<A href="equivNode.h">Program 6.20
equivNode.h</A>
<br>
<A href="unionFindWithChains.cpp">Program 6.21
unionFindWithChains.cpp</A>
<br>
<br><br>
<a name = "Chapter 7"></a>
<h3>Chapter 7 Programs</h3>
<A href="irregularArray.cpp">Program 8.1
irregularArray.cpp</A>
<br>
<A href="matrix.h">Program 7.2
matrix.h</A>
<br>
<A href="matrix.h">Program 7.3
matrix.h</A>
<br>
<A href="matrix.h">Program 7.4
matrix.h</A>
<br>
<A href="matrix.h">Program 7.5
matrix.h</A>
<br>
<A href="matrix.h">Program 7.6
matrix.h</A>
<br>
<A href="matrix.h">Program 7.7
matrix.h</A>
<br>
<A href="diagonalMatrix.h">Program 7.8
diagonalMatrix.h</A>
<br>
<A href="diagonalMatrix.h">Program 7.9
diagonalMatrix.h</A>
<br>
<A href="diagonalMatrix.h">Program 7.10
diagonalMatrix.h</A>
<br>
<A href="triDiagonalMatrix.h">Program 7.11
triDiagonalMatrix.h</A>
<br>
<A href="lowerTriangularMatrix.h">Program 7.12
lowerTriangularMatrix.h</A>
<br>
<A href="sparseMatrix.h">Program 7.13
sparseMatrix.h</A>
<br>
<A href="sparseMatrix.h">Program 7.14
sparseMatrix.h</A>
<br>
<A href="sparseMatrix.h">Program 7.15
sparseMatrix.h</A>
<br>
<A href="sparseMatrix.h">Program 7.16
sparseMatrix.h</A>
<br>
<A href="sparseMatrix.h">Program 7.17
sparseMatrix.h</A>
<br>
<A href="linkedMatrix.h">Program 7.18
linkedMatrix.h</A>
<br>
<br><br>
<a name = "Chapter 8"></a>
<h3>Chapter 8 Programs</h3>
<A href="stack.h">Program 8.1
stack.h</A>
<br>
<A href="derivedArrayStack.h">Program 8.2
derivedArrayStack.h</A>
<br>
<A href="derivedArrayStackWithCatch.h">Program 8.3
derivedArrayStackWithCatch.h</A>
<br>
<A href="arrayStack.h">Program 8.4
arrayStack.h</A>
<br>
<A href="linkedStack.h">Program 8.5
linkedStack.h</A>
<br>
<A href="parenthesisMatching.cpp">Program 8.6
parenthesisMatching.cpp</A>
<br>
<A href="hanoiRecursive.cpp">Program 8.7
hanoiRecursive.cpp</A>
<br>
<A href="hanoiWithStacks.cpp">Program 8.8
hanoiWithStacks.cpp</A>
<br>
<A href="railroadWithStacks.cpp">Program 8.9
railroadWithStacks.cpp</A>
<br>
<A href="railroadWithStacks.cpp">Program 8.10
railroadWithStacks.cpp</A>
<br>
<A href="railroadWithStacks.cpp">Program 8.11
railroadWithStacks.cpp</A>
<br>
<A href="railroadWithStacks.cpp">Program 8.12
railroadWithStacks.cpp</A>
<br>
<A href="switchBox.cpp">Program 8.13
switchBox.cpp</A>
<br>
<A href="equivalenceClasses.cpp">Program 8.14
equivalenceClasses.cpp</A>
<br>
<A href="maze.cpp">Program 8.15
maze.cpp</A>
<br>
<br><br>
<a name = "Chapter 9"></a>
<h3>Chapter 9 Programs</h3>
<A href="queue.h">Program 9.1
queue.h</A>
<br>
<A href="arrayQueue.h">Program 9.2
arrayQueue.h</A>
<br>
<A href="arrayQueue.h">Program 9.3
arrayQueue.h</A>
<br>
<A href="arrayQueue.h">Program 9.4
arrayQueue.h</A>
<br>
<A href="linkedQueue.h">Program 9.5
linkedQueue.h</A>
<br>
<A href="railroadWithQueues.cpp">Program 9.6
railroadWithQueues.cpp</A>
<br>
<A href="railroadWithQueues.cpp">Program 9.7
railroadWithQueues.cpp</A>
<br>
<A href="wireRouter.cpp">Program 9.8
wireRouter.cpp</A>
<br>
<A href="componentLabeling.cpp">Program 9.9
componentLabeling.cpp</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.10
machineShopSimulatorcpph</A>
<br>
<A href="task.h">Program 9.11
task.h</A>
<br>
<A href="job.h">Program 9.12
job.h</A>
<br>
<A href="machine.h">Program 9.13
machine.h</A>
<br>
<A href="eventList.h">Program 9.14
eventList.h</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.15
machineShopSimulator.cpp</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.16
machineShopSimulator.cpp</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.17
machineShopSimulator.cpp</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.18
machineShopSimulator.cpp</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.19
machineShopSimulator.cpp</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.20
machineShopSimulator.cpp</A>
<br>
<A href="machineShopSimulator.cpp">Program 9.21
machineShopSimulator.cpp</A>
<br>
<br><br>
<a name = "Chapter 10"></a>
<h3>Chapter 10 Programs</h3>
<A href="dictionary.h">Program 10.1
dictionary.h</A>
<br>
<A href="sortedChain.h">Program 10.2
sortedChain.h</A>
<br>
<A href="sortedChain.h">Program 10.3
sortedChain.h</A>
<br>
<A href="sortedChain.h">Program 10.4
sortedChain.h</A>
<br>
<A href="skipNode.h">Program 10.5
skipNode.h</A>
<br>
<A href="skipList.h">Program 10.6
skipList.h</A>
<br>
<A href="skipList.h">Program 10.7
skipList.h</A>
<br>
<A href="skipList.h">Program 10.8
skipList.h</A>
<br>
<A href="skipList.h">Program 10.9
skipList.h</A>
<br>
<A href="skipList.h">Program 10.10
skipList.h</A>
<br>
<A href="skipList.h">Program 10.11
skipList.h</A>
<br>
<A href="skipList.h">Program 10.12
skipList.h</A>
<br>
<A href="threeToLong.cpp">Program 10.13
threeToLong.cpp</A>
<br>
<A href="stringToInt.cpp">Program 10.14
stringToInt.cpp</A>
<br>
<A href="hash.h">Program 10.15
hash.h</A>
<br>
<A href="hashTable.h">Program 10.16
hashTable.h</A>
<br>
<A href="hashTable.h">Program 10.17
hashTable.h</A>
<br>
<A href="hashTable.h">Program 10.18
hashTable.h</A>
<br>
<A href="hashTable.h">Program 10.19
hashTable.h</A>
<br>
<A href="hashChains.h">Program 10.20
hashChains.h</A>
<br>
<A href="compress.cpp">Program 10.21
compress.cpp</A>
<br>
<A href="compress.cpp">Program 10.22
compress.cpp</A>
<br>
<A href="compress.cpp">Program 10.23
compress.cpp</A>
<br>
<A href="compress.cpp">Program 10.24
compress.cpp</A>
<br>
<A href="decompress.cpp">Program 10.25
decompress.cpp</A>
<br>
<A href="decompress.cpp">Program 10.26
decompress.cpp</A>
<br>
<A href="decompress.cpp">Program 10.27
decompress.cpp</A>
<br>
<A href="decompress.cpp">Program 10.28
decompress.cpp</A>
<br>
<br><br>
<a name = "Chapter 11"></a>
<h3>Chapter 11 Programs</h3>
<A href="binaryTreeNode.h">Program 11.1
binaryTreeNode.h</A>
<br>
<A href="binaryTreeTraversals.cpp">Program 11.2
binaryTreeTraversals.cpp</A>
<br>
<A href="binaryTreeTraversals.cpp">Program 11.3
binaryTreeTraversals.cpp</A>
<br>
<A href="binaryTreeTraversals.cpp">Program 11.4
binaryTreeTraversals.cpp</A>
<br>
<A href="binaryTreeTraversals.cpp">Program 11.5
binaryTreeTraversals.cpp</A>
<br>
<A href="infix.cpp">Program 11.6
infix.cpp</A>
<br>
<A href="binaryTreeTraversals.cpp">Program 11.7
binaryTreeTraversals.cpp</A>
<br>
<A href="binaryTree.h">Program 11.8
binaryTree.h</A>
<br>
<A href="linkedBinaryTree.h">Program 11.9
linkedBinaryTree.h</A>
<br>
<A href="linkedBinaryTree.h">Program 11.10
linkedBinaryTree.h</A>
<br>
<A href="linkedBinaryTree.h">Program 11.11
linkedBinaryTree.h</A>
<br>
<A href="booster.h">Program 11.12
booster.h</A>
<br>
<A href="booster.cpp">Program 11.13
booster.cpp</A>
<br>
<A href="unionFindWithTrees.cpp">Program 11.14
unionFindWithTrees.cpp</A>
<br>
<A href="unionFindNode.h">Program 11.15
unionFindNode.h</A>
<br>
<A href="unionFindWithWeightingRule.cpp">Program 11.16
unionFindWithWeightingRule.cpp</A>
<br>
<A href="unionFindWithCompaction.cpp">Program 11.17
unionFindWithCompaction.cpp, fastUnionFind.h</A>
<br>
<br><br>
<a name = "Chapter 12"></a>
<h3>Chapter 12 Programs</h3>
<A href="maxPriorityQueue.h">Program 12.1
maxPriorityQueue.h</A>
<br>
<A href="maxHeap.h">Program 12.2
maxHeap.h</A>
<br>
<A href="maxHeap.h">Program 12.3
maxHeap.h</A>
<br>
<A href="maxHeap.h">Program 12.4
maxHeap.h</A>
<br>
<A href="maxHblt.h">Program 12.5
maxHblt.h</A>
<br>
<A href="maxHblt.h">Program 12.6
maxHblt.h</A>
<br>
<A href="maxHblt.h">Program 12.7
maxHblt.h</A>
<br>
<A href="heapSort.h">Program 12.8
heapSort.h</A>
<br>
<A href="lptSchedule.cpp">Program 12.9
lptSchedule.cpp</A>
<br>
<A href="huffmanTree.cpp">Program 12.10
huffmanTree.cpp</A>
<br>
<br><br>
<a name = "Chapter 13"></a>
<h3>Chapter 13 Programs</h3>
<A href="winnerTree.h">Program 13.1
winnerTree.h</A>
<br>
<A href="firstFit.cpp">Program 13.2
firstFit.cpp</A>
<br>
<br><br>
<a name = "Chapter 14"></a>
<h3>Chapter 14 Programs</h3>
<A href="bsTree.h">Program 14.1
bsTree.h</A>
<br>
<A href="indexedBSTree.h">Program 14.2
indexedBSTree.h</A>
<br>
<A href="binarySearchTree.h">Program 14.3
binarySearchTree.h</A>
<br>
<A href="binarySearchTree.h">Program 14.4
binarySearchTree.h</A>
<br>
<A href="binarySearchTree.h">Program 14.5
binarySearchTree.h</A>
<br>
<A href="binarySearchTree.h">Program 14.6
binarySearchTree.h</A>
<br>
<A href="dBinarySearchTree.h">Program 14.7
dBinarySearchTree.h</A>
<br>
<A href="histogram.cpp">Program 14.8
histogram.cpp</A>
<br>
<A href="treeHistogram.cpp">Program 14.9
treeHistogram.cpp</A>
<br>
<A href="dBinarySearchTreeWithGE.h">Program 14.10
dBinarySearchTreeWithGE.h</A>
<br>
<A href="bestFit.cpp">Program 14.11
bestFit.cpp</A>
<br>
<A href="crossings.cpp">Program 14.12
crossings.cpp</A>
<br>
<br><br>
<a name = "Chapter 15"></a>
<h3>Chapter 15 Programs</h3>
Chapter 15 has no programs.
<br>
<br><br>
<a name = "Chapter 16"></a>
<h3>Chapter 16 Programs</h3>
<A href="graph.h">Program 16.1
graph.h</A>
<br>
<A href="adjacencyWDigraph.h">Program 16.2
adjacencyWDigraph.h</A>
<br>
<A href="linkedDigraph.h">Program 16.3
linkedDigraph.h</A>
<br>
<A href="graph.h">Program 16.4
graph.h</A>
<br>
<A href="adjacencyWDigraph.h">Program 16.5
adjacencyWDigraph.h</A>
<br>
<A href="linkedDigraph.h">Program 16.6
linkedDigraph.h</A>
<br>
<A href="graph.h">Program 16.7
graph.h</A>
<br>
<A href="graph.h">Program 16.8
graph.h</A>
<br>
<A href="graph.h">Program 16.9
graph.h</A>
<br>
<A href="graph.h">Program 16.10
graph.h</A>
<br>
<A href="graph.h">Program 16.11
graph.h</A>
<br>
<br><br>
<a name = "Chapter 17"></a>
<h3>Chapter 17 Programs</h3>
<A href="greedyLoading.h">Program 17.1
greedyLoading.h</A>
<br>
<A href="graph.h">Program 17.2
graph.h</A>
<br>
<A href="adjacencyWDigraph.h">Program 17.3
adjacencyWDigraph.h</A>
<br>
<A href="graph.h">Program 17.4
graph.h</A>
<br>
<br><br>
<a name = "Chapter 18"></a>
<h3>Chapter 18 Programs</h3>
<A href="minMax3.cpp">Program 18.1
minMax3.cpp</A>
<br>
<A href="tileBoard.cpp">Program 18.2
tileBoard.cpp</A>
<br>
<A href="mergeSort.h">Program 18.3
mergeSort.h</A>
<br>
<A href="mergeSort.h">Program 18.4
mergeSort.h</A>
<br>
<A href="mergeSort.h">Program 18.5
mergeSort.h</A>
<br>
<A href="quickSort.h">Program 18.6
quickSort.h</A>
<br>
<A href="quickSort.h">Program 18.7
quickSort.h</A>
<br>
<A href="select.cpp">Program 18.8
select.cpp</A>
<br>
<A href="select.cpp">Program 18.9
select.cpp</A>
<br>
<A href="closestPoints.cpp">Program 18.10
closestPoints.cpp</A>
<br>
<A href="closestPoints.cpp">Program 18.11
closestPoints.cpp</A>
<br>
<A href="closestPoints.cpp">Program 18.12
closestPoints.cpp</A>
<br>
<br><br>
<a name = "Chapter 19"></a>
<h3>Chapter 19 Programs</h3>
<A href="recursiveDPKnapsack.cpp">Program 19.1
recursiveDPKnapsack.cpp</A>
<br>
<A href="noRecomputationDPKnapsack.cpp">Program 19.2
noRecomputationDPKnapsack.cpp</A>
<br>
<A href="iterativeDPKnapsack.cpp">Program 19.3
iterativeDPKnapsack.cpp</A>
<br>
<A href="iterativeDPKnapsack.cpp">Program 19.4
iterativeDPKnapsack.cpp</A>
<br>
<A href="recursiveDPMatrixChain.cpp">Program 19.5
recursiveDPMatrixChain.cpp</A>
<br>
<A href="noRecomputationDPMatrixChain.cpp">Program 19.6
noRecomputationDPMatrixChain.cpp</A>
<br>
<A href="iterativeDPMatrixChain.cpp">Program 19.7
iterativeDPMatrixChain.cpp</A>
<br>
<A href="adjacencyWDigraph.cpp">Program 19.8
adjacencyWDigraph.cpp</A>
<br>
<A href="adjacencyWDigraph.cpp">Program 19.9
adjacencyWDigraph.cpp</A>
<br>
<A href="graph.cpp">Program 19.10
graph.cpp</A>
<br>
<A href="noncrossingSubset.cpp">Program 19.11
noncrossingSubset.cpp</A>
<br>
<A href="noncrossingSubset.cpp">Program 19.12
noncrossingSubset.cpp</A>
<br>
<br><br>
<a name = "Chapter 20"></a>
<h3>Chapter 20 Programs</h3>
<A href="recursiveBTLoading1.cpp">Program 20.1
recursiveBTLoading1.cpp</A>
<br>
<A href="recursiveBTLoading2.cpp">Program 20.2
recursiveBTLoading2.cpp</A>
<br>
<A href="recursiveBTLoading3.cpp">Program 20.3
recursiveBTLoading3.cpp</A>
<br>
<A href="recursiveBTLoading3.cpp">Program 20.4
recursiveBTLoading3.cpp</A>
<br>
<A href="iterativeBTLoading.cpp">Program 20.5
iterativeBTLoading.cpp</A>
<br>
<A href="recursiveBTKnapsack.cpp">Program 20.6
recursiveBTKnapsack.cpp</A>
<br>
<A href="recursiveBTKnapsack.cpp">Program 20.7
recursiveBTKnapsack.cpp</A>
<br>
<A href="recursiveBTKnapsack.cpp">Program 20.8
recursiveBTKnapsack.cpp</A>
<br>
<A href="recursiveBTKnapsack.cpp">Program 20.9
recursiveBTKnapsack.cpp</A>
<br>
<A href="adjacencyGraph.h">Program 20.10
adjacencyGraph.h</A>
<br>
<A href="adjacencyGraph.h">Program 20.11
adjacencyGraph.h</A>
<br>
<A href="adjacencyWDigraph.h">Program 20.12
adjacencyWDigraph.h</A>
<br>
<A href="adjacencyWDigraph.h">Program 20.13
adjacencyWDigraph.h</A>
<br>
<A href="recursiveBTBoard.cpp">Program 20.14
recursiveBTBoard.cpp</A>
<br>
<A href="recursiveBTBoard.cpp">Program 20.15
recursiveBTBoard.cpp</A>
<br>
<br><br>
<a name = "Chapter 21"></a>
<h3>Chapter 21 Programs</h3>
<A href="fifoBBLoading1.cpp">Program 21.1
fifoBBLoading1.cpp</A>
<br>
<A href="fifoBBLoading2.cpp">Program 21.2
fifoBBLoading2.cpp</A>
<br>
<A href="fifoBBLoading3.cpp">Program 21.3
fifoBBLoading3.cpp</A>
<br>
<A href="maxProfitBBLoading.cpp">Program 21.4
maxProfitBBLoading.cpp</A>
<br>
<A href="maxProfitBBLoading.cpp">Program 21.5
maxProfitBBLoading.cpp</A>
<br>
<A href="maxProfitBBKnapsack.cpp">Program 21.6
maxProfitBBKnapsack.cpp</A>
<br>
<A href="adjacencyGraph.h">Program 21.7
adjacencyGraph.h</A>
<br>
<A href="adjacencyWDigraph.h">Program 21.8
adjacencyWDigraph.h</A>
<br>
<A href="leastCostBBBoard.cpp">Program 21.9
leastCostBBBoard.cpp</A>
<br>


</FONT>
</BODY>
</HTML>
